Termination of the following Term Rewriting System could be disproven:
Generalized rewrite system (where rules with free variables on rhs are allowed):
The TRS R consists of the following rules:
tail(cons(X)) → XS
zeros → cons(0)
↳ GTRS
↳ CritRuleProof
Generalized rewrite system (where rules with free variables on rhs are allowed):
The TRS R consists of the following rules:
tail(cons(X)) → XS
zeros → cons(0)
The rule tail(cons(X)) → XS contains free variables in its right-hand side. Hence the TRS is not-terminating.